New Criteria of Some Bounded Approximation Properties
نویسندگان
چکیده
منابع مشابه
some properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولdetermination of some physical and mechanical properties red bean
چکیده: در این تحقیق، برخی خواص فیزیکی و مکانیکی لوبیا قرمز به-صورت تابعی از محتوی رطوبت بررسی شد. نتایج نشان داد که رطوبت بر خواص فیزیکی لوبیا قرمز شامل طول، عرض، ضخامت، قطر متوسط هندسی، قطر متوسط حسابی، سطح تصویر شده، حجم، چگالی توده، تخلخل، وزن هزار دانه و زاویه ی استقرار استاتیکی در سطح احتمال 1 درصد اثر معنی داری دارد. به طوری که با افزایش رطوبت از 54/7 به 12 درصد بر پایه خشک طول، عرض، ضخام...
15 صفحه اولNotes on “Some Properties of L-fuzzy Approximation Spaces on Bounded Integral Residuated Lattices”
In this note, we continue the works in the paper [Some properties of L-fuzzy approximation spaces on bounded integral residuated lattices", Information Sciences, 278, 110-126, 2014]. For a complete involutive residuated lattice, we show that the L-fuzzy topologies generated by a reflexive and transitive L-relation satisfy (TC)L or (TC)R axioms and the L-relations induced by two L-fuzzy topologi...
متن کاملSome New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کاملSome New Randomized Approximation Algorithms
The topic of this thesis is approximation algorithms for optimization versions of NP-complete decision problems. No exact algorithms with sub-exponential running times are known for these problems, and therefore approximation algorithms with polynomial running times are studied. An approximation algorithm does not necessarily nd the optimal solution, but it leaves a guarantee of how far from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2011
ISSN: 1027-5487
DOI: 10.11650/twjm/1500406286